Feeding the multitude: A polynomial-time algorithm to improve sampling
نویسندگان
چکیده
منابع مشابه
extensions of some polynomial inequalities to the polar derivative
توسیع تعدادی از نامساوی های چند جمله ای در مشتق قطبی
15 صفحه اولPolynomial time perfect sampling algorithm for two-rowed contingency tables
This paper proposes a polynomial time perfect (exact) sampling algorithm for 2 × n contingency tables. The algorithm is based on monotone coupling from the past (monotone CFTP) algorithm. The expected running time is bounded by O(n lnN) where n is the number of columns and N is the total sum of all entries.
متن کاملOffering a New Algorithm to Improve the Answer-Search Algorithm in Quadratic Assignment Problem
Layout design problem is one of the useful field of study used to increase the efficiency of sources in organizations. In order to achieve an appropriate layout design, it is necessary to define and solve the related nonlinear programming problems. Therefore, using computer in solving the related problems is important in the view of the researchers of this area of study. However, the designs pr...
متن کاملA Polynomial Time SAT Algorithm
An algorithm of two parts is presented that determines existence of and instance of an assignment satisfying of instances of SAT. The algorithm employs an unconventional approach premised on set theory, which does not use search or resolution, to partition the set of all assignments into nonsatisfying and satisfying assignments. The algorithm, correctness, and time and space complexity proofs a...
متن کاملA Polynomial-Time Slicing Algorithm
In an earlier work, we have introduced slicing for Abstract State Machines (ASMs). The idea of this concept is analogous to the one of program slicing which is an established technique for extracting statements from a program that are relevant for its behaviour at a given point of interest. These statements form again a syntactically correct program called a slice. We have identified a class of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2019
ISSN: 2470-0045,2470-0053
DOI: 10.1103/physreve.99.043306